Response time in a tandem queue with blocking, Markovian arrivals and Phase-type services: Extended Version
نویسندگان
چکیده
A novel approach for obtaining the response time in a discrete time tandem queue with blocking, using matrix analytic methods, is presented. The approach sets up the appropriate Markov chain based on the age of the leading customer in the first queue, together with other auxiliary variables. By this approach the response time is obtained with only minor additional effort after obtaining the stationary distribution of the Markov chain. The queue length distributions, if needed, can still be obtained from the stationary distributions. We also study the stability conditions of this system and carry out several numerical examples that give us insight to how the system behaves.
منابع مشابه
Response time in a tandem queue with blocking, Markovian arrivals and phase-type services
A novel approach for obtaining the response time in a discrete-time tandem-queue with blocking is presented. The approach constructs a Markov chain based on the age of the leading customer in the first queue. We also provide a stability condition and carry out several numerical examples. © 2004 Elsevier B.V. All rights reserved.
متن کاملA Study on State Dependent Accessible and Second Optional Service Queue with Impatient and Feedback Customers
In this paper, we study a single server Markovian queue with state dependent accessible services, reneging and feedback of customers. The server can accommodate at the most $d$ customers in the service station, after which the new arrivals have to wait in the primary queue of infinite waiting space. All arrivals demand First Essential Service (FES), after completing FES, customers decide to joi...
متن کاملA Preemptive Priority Queue as a Model with Server Vacations
We derive the performance measures for non-priority customers in a priority single-server queue with two types of Markovian arrival processes (MAPs). One type of customers has preemptive resume (or repeat) priority over the other. We regard the model with two types of MAP arrivals as an MAP/SM/l queue with only non-priority customers arrivals, semi-Markovian service times and some server vacati...
متن کاملA server backup model with Markovian arrivals and phase type services
We consider a finite capacity queueing system with one main server who is supported by a backup server. We assume Markovian arrivals, phase type services, and a threshold-type server backup policy with two pre-determined lower and upper thresholds. A request for a backup server is made whenever the buffer size (number of customers in the queue) hits the upper threshold and the backup server is ...
متن کاملAnalysis of a finite MAP/G/1 queue with group services
The finite capacity queues, G I / P H / 1 / N and PH/G/1 /N, in which customers are served in groups of varying sizes were recently introduced and studied in detail by the author. In this paper we consider a finite capacity queue in which arrivals are governed by a particular Markov renewal process, called a Markovian arrival process (MAP). With general service times and with the same type of s...
متن کامل